Ear decomposition

Results: 86



#Item
11Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Concept Graphs without Negations: Standardmodels and Standardgraphs Frithjof Dau Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt,

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2007-08-09 21:04:38
12Distributed Community Detection on Edge-labeled Graphs using Spark San-Chuan Hung Miguel Araujo

Distributed Community Detection on Edge-labeled Graphs using Spark San-Chuan Hung Miguel Araujo

Add to Reading List

Source URL: www.mlgworkshop.org

Language: English - Date: 2016-08-14 01:22:56
13Advances in Cognitive SystemsSubmitted; publishedExploiting Graph Structure to Abstract & Compress Relational Data

Advances in Cognitive SystemsSubmitted; publishedExploiting Graph Structure to Abstract & Compress Relational Data

Add to Reading List

Source URL: www.cogsys.org

Language: English - Date: 2016-06-16 21:32:57
14Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Algorithms for subnetwork mining in heterogeneous networks Guillaume Fertin, Hafedh Mohamed-Babou and Irena Rusu LINA, UMR 6241, Universit´e de Nantes, France {Guillaume.Fertin, Hafedh.Mohamed-Babou, Irena.Rusu}@univ-na

Add to Reading List

Source URL: pagesperso.lina.univ-nantes.fr

Language: English - Date: 2012-04-20 08:45:09
15Nested Concept Graphs with Cuts: Mathematical Foundations Frithjof Dau, Joachim Hereth Correia Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, {dau,hereth}@mathematik.t

Nested Concept Graphs with Cuts: Mathematical Foundations Frithjof Dau, Joachim Hereth Correia Technische Universit¨ at Darmstadt, Fachbereich Mathematik Schloßgartenstr. 7, DDarmstadt, {dau,hereth}@mathematik.t

Add to Reading List

Source URL: www.dr-dau.net

Language: English - Date: 2007-08-09 21:04:38
16VERTEX PERFECT GRAPHS  By Riley Littlefield  A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF

VERTEX PERFECT GRAPHS By Riley Littlefield A SENIOR RESEARCH PAPER PRESENTED TO THE DEPARTMENT OF

Add to Reading List

Source URL: www2.stetson.edu

Language: English - Date: 2015-04-24 19:11:58
17An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

An optimal algorithm for the k-fixed-endpoint path cover on proper interval graphs George B. Mertzios and Walter Unger Department of Computer Science RWTH Aachen, Germany {mertzios, quax}@cs.rwth-aachen.de

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2008-11-30 14:19:38
18Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic

Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic

Add to Reading List

Source URL: library.utia.cas.cz

Language: English - Date: 2012-08-15 08:16:50
19New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs∗ † Archontia C. Giannopoulou‡ §

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2016-05-11 15:56:58
20PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

PATHS, TREES, AND FLOWERS JACK E D M O N D S 1. Introduction. A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertic

Add to Reading List

Source URL: www.cs.mun.ca

Language: English - Date: 2015-03-23 10:06:06